Method and apparatus for error data recovery

ABSTRACT

The present invention provides a mechanism for preventing quality degradation of decoded data during the decoding of encoded data. In one embodiment, error propagation is detected and corresponding data is flagged. An error recovery process is then applied to the flagged data. In an alternate embodiment, scores for candidate hypotheses are calculated for lost/damaged data. A score distribution is used for detection of the false candidate hypotheses. The data are flagged if their score distribution is within a range defined by a threshold and an error recovery process is applied to recover those data having associated error flags set.

BACKGROUND OF THE INVENTION

[0001] 1. Field of the Invention

[0002] The present invention relates to the recovery of lost or damaged encoded data. More particularly, the present invention relates to the minimizing of quality degradation caused by error propagation in bitstreams containing lost or damaged encoded data.

[0003] 2. Art Background

[0004] It is quite common to compress data to minimize transmission or storage bandwidth requirements. One type of compression process is referred to as variable length coding. In variable length coding processes, the signal is typically divided into several localized regions, also referred to as blocks, and is coded by quantizing each region according to its signal activity level. In an exemplary signal such as signals representative of digital images, different parts of the images have different activity levels and are therefore coded with a different number of quantization bits.

[0005] The information regarding the number of quantization bits used for coding different regions is used by the decoder to delineate the respective quantization bits of each block from the received bitstream, which in turn is used to decode the blocks. Therefore, when the information regarding the number of quantization bits used to encode data is lost, a recovery process is implemented to estimate the number of quantization bits used to generate the codes representative of the data. If the number of quantization bits is not accurately estimated, the error incurred will propagate through the bitstream as the decoder is unable to determine the location of the end of one block, and therefore the beginning of the next block.

[0006] One type of variable length encoding is known as Adaptive Dynamic Range Coding (ADRC). For further information regarding ADRC, see, “Adaptive Dynamic Range Coding Scheme for Future HDTV Digital VTR”, Kondo, Fujimori, Nakaya, Fourth International Workshop on HDTV and Beyond, Sep. 4-6, 1991, Turin, Italy.

[0007] In one example of ADRC, blocks are encoded using a minimum pixel value (MIN), the dynamic range (DR) of pixel values in the block, the motion flag (MF) indicative of temporal activity and the quantization codes (Q codes) representative of each pixel in a block. The Q codes are generated based upon a minimum value, quantization step and the original pixel value. The quantization step is determined by the DR of the block and the number of quantization bits (Qbit), wherein the Qbit is a function of DR.

[0008] When the encoded bits are received in the decoder, the Qbit and MF information of each block is needed to delineate the portion of the bitstream corresponding to each block, and in turn to decode the block. If the DR and/or MF of the block is damaged, it is necessary to recover or estimate the information in order that the blocks can be decoded. At the same time, in case of a recovery failure, this error will likely result in incorrect decoding of the rest of the blocks and, in turn, severe picture degradation, since the starting point of subsequent blocks in the bitstream will be incorrectly identified.

SUMMARY OF THE INVENTION

[0009] The present invention provides a mechanism for preventing quality degradation of decoded data during the decoding of encoded data. In one embodiment, error propagation is detected and corresponding data is flagged. An error recovery process is then applied to the flagged data. In an alternate embodiment, candidate hypotheses are calculated for lost/damaged data. A score distribution is used for detection of the false candidate hypotheses. The data are flagged if their score distribution is within a range defined by a threshold and an error recovery process is applied to recover those data having associated error flags set.

BRIEF DESCRIPTION OF THE DRAWINGS

[0010] The objects, features and advantages of the present invention will be apparent to one skilled in the art in light of the following description in which:

[0011]FIG. 1a illustrates one embodiment of a system of the present invention, FIG. 1b illustrates an alternate embodiment of the system of the present invention, and FIG. 1c illustrates an alternate embodiment of the system of the present invention.

[0012]FIG. 2 is a block diagram illustration of one embodiment of a sub-system for the recovery of block parameters.

[0013]FIG. 3 is a block diagram illustration of one embodiment of a sub-system for determining a measure for different hypotheses.

[0014]FIG. 4 is a block diagram illustration of one embodiment of a sub-system for scoring the different hypotheses.

[0015]FIG. 5 illustrates an example of the effect of error propagation on score distribution.

[0016]FIG. 6 shows exemplary histograms of score distribution for recovery of block parameters.

[0017]FIG. 7 illustrates an example of successive score distribution following Qbit and Motion Flag recovery.

[0018]FIG. 8 is a block diagram illustration of one embodiment of a sub-system for detection of error propagation.

[0019]FIG. 9 is a flow diagram illustrating one embodiment of a process for recovering lost or damaged data.

[0020]FIG. 10 is a flow diagram illustrating an alternate embodiment of a process for recovering lost or damaged data.

[0021]FIG. 11 is a flow chart illustrating one embodiment of a pixel error recovery process.

[0022]FIG. 12 illustrates parameters of an audio signal.

DETAILED DESCRIPTION

[0023] In the following description, for purposes of explanation, numerous details are set forth in order to provide a thorough understanding of the present invention. However, it will be apparent to one skilled in the art that these specific details are not required in order to practice the present invention. In other instances, well known electrical structures and circuits are shown in block diagram form in order not to obscure the present invention unnecessarily.

[0024] The system and method of the present invention provides an innovative mechanism for preventing quality degradation caused by error propagation in variable length encoded data. The discussion herein is directed to the recovery of image data, and in particular, Adaptive Dynamic Range Coding (ADRC). However, the invention is not limited to image data and can be applied to other types of correlated data including audio data. Furthermore, the present invention is not limited to ADRC; other variable length encoding processes may also be used. For example, the present invention is applicable to coding processes using Discrete Cosine Transform (DCT). In one embodiment, DCT coefficients of individual blocks can be quantized based upon respective activity levels, and the quantized coefficients are transmitted.

[0025] One embodiment of a system that operates in accordance with the teachings of the present invention is illustrated in FIG. 1a. The encoded bitstream of data, error flags indicating portions of data that are lost or damaged (lost/damaged), and decoded data (referred to in this example as image data) are input to Qbit and Motion Flag recovery circuit 10. The Qbit and Motion Flag recovery circuit 10 generates hypotheses, referred to herein as candidate hypotheses, of possible number of quantization bits (Qbit) used and motion flag (MF) values. As will be described in more detail below, a score is generated with respect to each hypothesis and the hypothesis with the best score, e.g., minimum score, is selected as the recovered values. The data decoded using the selected hypothesis is output as the decoded data to the memory 30.

[0026] The scores and error flags corresponding to data decoded using the selected hypothesis is input to error propagation detection circuit 20. As will be discussed below, error propagation detection circuit 20 evaluates candidate hypotheses to generate candidate hypotheses results used to detect error propagation. In one embodiment, circuit 20 examines the score distribution and detects error propagation due to false candidate decoding. Other evaluation techniques may be used, including evaluation of score distribution patterns or other metrics. Pixel error recovery block 40, receives the decoded data error flags as well as flags that may have been generated by the error propagation detection circuit 20 to indicate that pixel error recovery is warranted and performs a pixel error recovery process to recover pixel data that may not be correct due to error propagation.

[0027] An alternate embodiment is illustrated in FIG. 1b. In this embodiment, a general purpose or specially configured processing system 50 performs the methods described herein. In this embodiment, the processing system 50 includes a processor 55, a memory 60 and input/output circuitry 65. Other circuitry not shown herein may also be included.

[0028] In one embodiment, the memory can store instructions, which when executed by processing system 50, perform the methods described herein. Alternately, the instructions may be stored on other storage media or transmitted across a transmission media, such as a network, to the processor 55. Memory 60 can also be configured to store data used and generated as described herein.

[0029] Input/output circuitry 65, receives the encoded data, error flags and image data for processing by processing system 50 and outputs the recovered data generated.

[0030] An alternate embodiment is illustrated by FIG. 1c. In this embodiment, the bitstream of data is input into decoder 70 and candidate decoder 72. The decoder 70 decodes those portions of the bitstream that are decodable using standard available decoding processes, i.e., portions containing no errors. Candidate decoder 72 generates candidate decodings and selects a best candidate decoding as discussed herein. Error propagation detection circuit 74 detects errors which occur due to error propagation, for example, those errors caused by selection of an incorrect candidate decoding. The prevent degradation circuit 76 receives the decoded data output by decoder 70 and error propagation flags generated by error propagation detection circuit 74 and performs block processing to recover blocks of data flagged to have errors. In one embodiment, block processing estimates block data using neighboring block data. Other block processing techniques may be used.

[0031] Pixel error flag circuit 80 receives flags indicating the pixel data which may contain errors. Typically, the flags are generated using known Error Correction Code (ECC) techniques.

[0032] Pixel error recovery circuit 78 receives input from prevent degradation circuit 76 and pixel error flag circuit 80 and performs a pixel error recovery process data for having corresponding error flags set. A pixel error recovery process, such as the classified adaptive error recovery process discussed below, may be used.

[0033] A more detailed block diagram of one embodiment of the Qbit and Motion Flag recovery circuit is shown in FIG. 2. In this embodiment, candidate decoding and error measure circuit 205 determines possible hypotheses, i.e., values of Qbit and/or MF, and generates candidate decodings of Q codes based upon each of the hypotheses. Alternately, the hypothesis can be evaluated in the encoded domain, eliminating the need for decoding the data for all hypotheses.

[0034] An error measure is generated for each hypothesis. In one embodiment, an error measure may be determined based upon how well the candidate decoding fits into with other decoded data. For example, the measure may show how well correlated the candidate decoding is with other decoded data. Linear error, square error and Laplacian measurements may also be used.

[0035] One measure that can be used is square error measurements on decoded data. In one embodiment, the decoded domain square error measurement can be obtained using the following formula: ${{SquareError}({HypNo})} = {\sum\limits_{i}{\sum\limits_{j \in {R{(i)}}}\left\lbrack {y_{i}^{\prime} - y_{j}} \right\rbrack^{2}}}$

[0036] where y_(i)′ represents the i-th decoded pixel value of the block being recovered for the hypothesis HypNo. and y_(j) represents one of the neighboring decoded pixel values of the i-th pixel, R(i) represents a set of neighboring pixels to the i-th pixel and $y_{i}^{\prime} = {{MIN} + \frac{{DR}\left( {q_{i} + 0.5} \right)}{2^{Q}}}$

[0037] where DR is the recovered dynamic range value, q_(i) is the i-th Q code and Q is the Qbit number corresponding to the hypothesis HypNo.

[0038] In one embodiment, the data in the encoded domain is evaluated with respect to each hypothesis to generate corresponding error measures. For example, a linear error measure may be determined from encoded data as follows: $\begin{matrix} {{{LinearError}({HypNo})} = {\sum\limits_{i}{\sum\limits_{j \in {R{(i)}}}{{{a1}_{i} - {a2}_{j}}}}}} \\ {{a1}_{i} = {{adj}\left( {q1}_{i} \right)}} \\ {{{adj}\left( {q1}_{i} \right)} = {{2^{5 - {Q1}}{q1}_{i}} + 2^{4 - {Q1}}}} \\ {{a2}_{j} = {{adj}\left( {q2}_{j} \right)}} \\ {{{adj}\left( {q2}_{i} \right)} = {{2^{5 - {Q2}}{q2}_{j}} + 2^{4 - {Q2}} + {Offset}}} \\ {{Offset} = {\frac{1}{N}{\sum\limits_{i}{\sum\limits_{j \in {R{(i)}}}\left( {{q1}_{i} - {q2}_{j}} \right)}}}} \end{matrix}$

[0039] where q1_(i) represents the Q code of the i-th pixel of the block being recovered (block 1), q2_(j) represents the Q code of a neighboring pixel of the i-th pixel of a neighboring block (block 2), N is the number of neighboring-pair relations, Q1 and Q2 respectively represent the hypothesized Qbit number of the block being recovered and the Qbit number of the neighboring block. R(i) represents the neighboring pixels with respect to the i-th pixel of the block being recovered, and a1i and a2j represent a rescaled value of a2j. The function adj( ) as defined above performs a Q code resealing process to normalize the values for more accurate measurements.

[0040]FIG. 3 illustrates one embodiment of a circuit which implements the encoded domain linear error measure. Candidate decodings 305, 307, 309, 311, 313, 315 are performed based upon the different hypothesis, e.g., hypotheses 0-5. For each hypothesis, the hypothesized Q code for the block to be recovered (q1), the Q code for a neighboring block (q2) and Q code error flags determined for the particular hypothesis are input to a linear error measurement circuit 317, 319, 321, 323, 325, 327 to generate the linear error measure, Linear Error 0-5. The measure may be determined in accordance with the equations described above.

[0041] Referring back to FIG. 2, the error measures are input to scoring circuit 210 which determines which hypothesis generates the best score. A variety of techniques can be used to determine the best score. For example, confidence weighted scoring, majority based scoring, simple accumulation based scoring and majority decision scoring can be used. In one embodiment the score is determined as follows: ${{score}(i)} = {\sum\limits_{j}{G\left( \frac{{m\left( {i,j} \right)} - {\min (j)}}{{m\left( {i,j} \right)} + {\min (j)}} \right)}}$

[0042] where m(i, j) represents the j-th measurement for hypothesis i for the block or block group (e.g., 3 blocks which form a group), min(j) is the minimum of the j-th measurement among different hypotheses, and G( ) is an identity function or a monotonically increasing function, depending on the application. G may be selected to be a function that increases the sensitivity of the scoring such that incorrect hypotheses will be clearly distinguishable from the correct hypothesis. For example, a square or linear function may be used. Alternately, G may be a constant, including one having a value of unity.

[0043] Alternately, if an accumulation function of, for example, linear error measures, is performed to produce a score, the score would be determined as follows: ${{score}(i)} = {\sum\limits_{j}{m\left( {i,j} \right)}}$

[0044] In this example if the measure is linear error, the hypothesis with the lowest score is determined as the best score. However, it should be realized that the optimal choice can depend on the type of measure, application and compression algorithm used.

[0045]FIG. 4 illustrates one embodiment of a circuit to determine the best score. In this embodiment, the error measures, e.g., linear error 0-5 are respectively input to function G[.]0 to G[.]5 405, 407, 409, 411, 413, 415. The minimum score can also be input to functions G[.]0 to G[.]5 and the values output are summed by adder logic 421, 423, 425, 427, 429, 431 to produce scores Score(0) to Score(5). In this embodiment, the minimum value determined by minimum circuit 435 is identified as the best score.

[0046] Referring back to FIG. 2, the best score is input to the selectors 215 and 220 which respectively output decoded data of the selected hypotheses corresponding to the best score and error flags identified with particular portions of the decoded data decoded according to the selected hypothesis.

[0047] As noted earlier, if the hypothesis chosen is not correct, subsequent blocks of data will also be incorrectly decoded. This is illustrated with respect to FIG. 5. Representation 505 illustrates an example of encoding blocks in signal space. For example, representation 505 may be a representation of an image frame which contains blocks of data.

[0048] In one embodiment, image 505 shows a plurality of pixels, e.g., 510, 511, 514, 516, 518 which are encoded to produce an encoded bitstream 520. If, for example, block i is incorrectly decoded such that the length of the Q codes is not accurate, the error will propagate to subsequent blocks, e.g., blocks i+1, i+2, etc., as the starting points of the subsequent blocks are not correctly identified. As an illustration, bitstream 520 illustrates the correct start point 550 for block i and incorrect start point 555 for block i+1.

[0049] Whenever the selected hypothesis is wrong, scores are very similar among candidate hypotheses. The threshold point can be selected such that all incorrect recovery results are surely detected. Typically, such a threshold also results in a few false alarms, i.e., some correct recovery results are detected as incorrect (shown as the shaded area in FIG. 6), and a subsequent error recovery process such as the pixel recovery process below, is used to recover the corresponding pixels. FIG. 6 further illustrates a proper threshold selection.

[0050] The thresholds can be empirically determined for a particular application using known data. For example, for 4 bit ADRC encoding, the threshold may be set to approximately a value of 120.

[0051] In one embodiment, score distributions in successive recoveries are used to reinforce the error detection decision. Given that the current hypothesis is correct, the recovery start point of a next block or group of blocks in the bitstream is also correct. If the start point is correct, candidate hypotheses for subsequent blocks or groups of blocks will generate pixels that exhibit highly correlated properties with respect to neighboring blocks resulting in large score distributions. If the start point is incorrect, candidate hypotheses for subsequent blocks or group of blocks will generate pixels that are uncorrelated with the neighboring pixels resulting in uncorrelated score distributions.

[0052] The score distributions previously computed can therefore be used to flag propagation errors. For example, referring to FIG. 5, score distribution 550 illustrates the selection of an incorrect hypothesis. As noted above, if an incorrect hypothesis is chosen, the starting points for subsequent blocks may not be correct. Score distributions for subsequent blocks can be used to determine error propagation. For example, score distribution 555 shows the score distribution for block i+1 when the starting point is incorrect and score distribution 560 shows the score distribution for block i+1 when the starting point is correct.

[0053] The likelihood that the hypothesis with the best score is correct may be indicated by the score distribution sd(i) among candidate hypotheses. The score distribution can be measured in terms of statistics of various order, including standard deviation, average, median, difference of best score and second best score, difference of best score and average of best scores, etc. A score distribution may be chosen so that the score distribution curve for the correct recovery is completely non-overlapping with the score distribution curve for incorrect recovery.

[0054] A measurement criterion can be chosen that is highly sensitive to scoring variation among candidate hypothesis. The optimal choice depends on the measurement and scoring techniques used in conjunction with the parameter, i.e., Qbit and Motion Flag, recovery technique as well as the type of data, for example, audio or video.

[0055] For example, if linear error measurements are used in conjunction with simple accumulation based scoring of the linear error measurements, the difference between the best and second best linear error scores may be used as a metric for score distribution. Thus, continuing with the present example, the score distribution for the i-th block or group can be measured as sd(i)=score(second best)−score(best), where score(best) represents the score for the contemplated best hypothesis, and score(second best) represents the score for the contemplated second best hypothesis.

[0056] The likelihood that a chosen hypothesis is correct may also be determined based on a compatibility measurement. One embodiment of this concept may utilize the decoded domain square error measurement. Pixels belonging to a localized block are highly correlated with neighboring pixels, and as a result, the square error measurement may yield a low value, although in general, the higher the dynamic range, the higher the square error. However, for a given dynamic range, an incorrect hypothesis results in a much higher square error measurement than that resulting from a correct hypothesis. Thus, the ratio of square error measurement and dynamic range can be alternatively used in place of the score distribution measurement sd.

[0057] As noted earlier, the error detection process based on score distribution measurements sd(i) for a block or group i can be reinforced by combining the score distribution measurements of the successive blocks in the bitstream, e.g., i+1, i+2 . . . i+W. where W is a length of what is referred to herein as reinforcement window. In one embodiment when groups of 3 blocks are processed together, W may be equal to 2. Other values of W may be selected depending upon the application and performance desired.

[0058]FIG. 7 shows a typical score distribution sd of successive blocks or groups (referred to herein collectively as block units) following recovery for the i-th block unit. If the current recovery result for block i is incorrect, recovery start points of all successive blocks (i+1 . . . i+W) within the reinforcement window W becomes incorrect and as a consequence, the corresponding score distribution measurements are small. If the current recovery result is correct, score distribution measurements of successive block units are large. Therefore, score distributions or successive units within a predetermined reinforcement window can be combined to generate an integrated robust measurement for error propagation detection.

[0059] Several schemes can be employed for combining successive score distribution measurements, including empirically weighted averaging within the reinforcement window, or simple addition of score distribution measurements within the window.

[0060] For example, if the combined score for unit i is: ${{{comb\_ sd}(i)} = {{\sum\limits_{j = 0}^{W}{{sd}\left( {i + j} \right)}} \leq {comb\_ thr}}},$

[0061] the recovery result is detected as an incorrect one if the current score sd(i) is less than or equal to a threshold value ind-thr and comb_thr is a preset threshold value for multiple block units within the reinforcement window.

[0062] As noted earlier, the threshold values may be empirically determined. For example, the individual threshold may be a value of approximately 120, and the combined threshold may be a value of approximately 800 when W=2.

[0063] Alternately, a majority decision can be employed. For example, if: ${{comb\_ sd}(i)} = {\sum\limits_{j = 0}^{W}{\min\left( {1,{\max \left( {0,{{{sd}\left( {i + j} \right)} - {\tau (j)}}} \right)}} \right)}}$

[0064] is less than W/2, the recovery result is marked as an incorrect one. τ(j) is a constant or variable threshold within the reinforcement window. In one embodiment, τ(j) is a predetermined constant that increases in value according to the block number in the block sequence being examined. For example, for 3-block units, τ(0) may be approximately equal to 120, τ(1) may be approximately equal to 200 and τ(2) may be approximately equal to 300.

[0065] Other methods of combining the information of a plurality of blocks or groups of blocks can also be used.

[0066]FIG. 8 is one embodiment of a circuit for error propagation estimation. The scores for a particular block are evaluated to determine the best and second best score. This is determined by circuits 805 and 810. The difference between the best and second best score is determined by element 815. The scores are then temporarily stored in registers 820, 825, so as to accumulate scores in the present embodiment for a group of three blocks within a reinforcement window of length 3. The difference values are then summed to perform by adder 830 to produce a combined value which is compared to the combined threshold 840 by comparator 845. If the threshold is not exceeded, an error flag is raised which is then combined by OR gate logic 850 with other error flags which may have been previously determined to generate the pixel error flags that indicate that a pixel recovery process is required for these particular pixels.

[0067]FIG. 9 illustrates one embodiment of a process for recovering data, and in particular for detecting error propagation in a bitstream of data. At step 905 the start point of a block or group of blocks is identified. If an error is found in the bitstream corresponding to that start point, a recovery process is initiated to provide candidate decodings. For example, in one embodiment candidate decodings of Motion Flag and Qbit data may be generated based upon specified parameters. At step 920, each hypothesis is scored and the candidate with the best score is selected, step 925. The score distribution sd, is measured.

[0068] At step 935, if the error flag, DetectErrorFlag, is set, then the score distribution is combined with a prior combined score distribution variable comb_sd, and a counter (j) is incremented, step 950. Thus the combined score distribution comb sd is generated for a predetermined number of blocks within the reinforcement window W.

[0069] The combined score distribution value is then compared to a combined threshold value comb_thr to determine whether subsequent blocks require pixel recovery as the error in a previous block has caused error propagation to occur in the subsequent blocks. At step 940, if an individual score distribution is within a range defined by the threshold value, e.g., does not exceed the individual threshold value, the error flag is set, step 945. Further, a sum of subsequent score distributions is generated and a counter maintained to sum up the score distributions for W blocks or groups of blocks within the reinforcement window, step 955.

[0070] Once the combined score distribution has been generated for the number of blocks within the reinforcement window, at step 960, the combined score distribution is compared to the combined threshold value comb_thr. If a combined score distribution is not within the range defined by the threshold value, e.g., exceeds or equals the combined threshold value, the error flag and counter are reset and the next block is examined, steps 965, 905. This is indicative of the fact that error propagation did not occur and pixel recovery is not required for those blocks. However, if the combined score distribution is within the range, e.g., less than the combined threshold, step 960, error propagation flags are set for remaining undecoded pixels, step 970. The error propagation flags are optionally combined with other error flags, step 974, and pixel error recovery processing is performed on the error flagged pixels, step 978.

[0071] One embodiment of the process is illustrated in FIG. 10. FIG. 10 performs steps 1005, 1010, 1015, 1020, 1025, 1030, 1035, 1040, 1045, 1050, 1055, 1060, 1065, that are similar to those steps discussed above with respect to FIG. 9. In addition, the process as set forth in FIG. 10 marks the past W blocks for pixel recovery if the combined score distribution is within the range defined by the combined threshold value, step 1070. If there are more blocks to process, the error flag and the counter are reset and the next block examined, step 1075 and 1005. Pursuant to steps 1075 and 1080, pixel error recovery is performed on those pixels with associated error flags set, step 1075, is optional. Thus, in one embodiment a pixel recovery process is performed on pixel errors flagged due to error propagation.

[0072] The embodiment set forth in FIG. 10 allows for those instances where the start points may naturally realign even though earlier blocks contained erroneous start points. Thus, pixel recovery will only be applied to those blocks or groups of blocks that have been examined and determined in the range defined by the threshold.

[0073] As noted above, once the error flags are set, whether due to error propagation or earlier error detection, a pixel recovery process is performed (e.g., steps 978 FIG. 9, step 1080 FIG. 10). In one embodiment, neighboring blocks are used to recover pixels or pixel data contained in erroneous blocks. For example, classified adaptive error recovery processing can be used to generate the pixels using available neighboring pixels. This is disclosed in U.S. Pat. No. 5,469,216, which is incorporated herein by reference. Alternately, a classified adaptive error recovery process such as is explained below may be used.

[0074] Classification with respect to a deteriorated input signal, e.g., a signal containing lost/damaged data, is performed according to the input signal characteristics. The correct adaptive filter is prepared for each class prior to error recovery processing. More than one classification method may optionally be used to create the plurality of classes. Created classes may include a motion class, an error class, a spatial activity class, or a spatial class.

[0075] Classified adaptive error recovery is the technology which utilizes classified adaptive filter processing. A correct classification with respect to the deteriorated input signal is performed according to the input signal characteristics. An adaptive filter is prepared for each class prior to error recovery processing. A plurality of classes is generated based upon characteristics of the data points. The data points are classified as belonging to one of the plurality of classes and assigned a corresponding signal class. An undeteriorated signal is output corresponding to the input signal in accordance with the input signal class ID. Block data may be generated from the plurality of data points.

[0076] A flow diagram of an embodiment is shown in FIG. 11. The flow chart of FIG. 11 shows the basic processing stream for generating an undeteriorated signal, i.e., a recovered signal, from the deteriorated input signal which contains lost/damaged data. At step 1115, the preprocessing for peripheral erroneous pixels is performed. For example, an erroneous pixel may be replaced with horizontal neighboring data when there are no horizontal errors. If horizontal errors exist, the erroneous pixel may be replaced with vertical neighboring data. If vertical errors also exist, the erroneous pixel may be replaced with previous frame data.

[0077] At step 1117, each classification regarding the deteriorated input signal is executed to generate a class ID. Some class taps are selected adaptively according to another class ID. Multiple classifications may be executed, such as motion classification, error classification, spatial activity classification and spatial classification.

[0078] The classification scheme can be defined during system design, where the classification scheme, the number of classes, and other specification are decided for the target data. The design stage may include, among others, considerations of system performance and hardware complexity.

[0079] At step 1119, multiple classification generates a multiple class ID with a plurality of class IDs which are generated by various classification at step 1117. At step 1121, filter taps are adaptively selected according to the multiple class ID which is generated at step 1119. At step 1123, the filter tap structure is adaptively expanded according to the multiple class ID which is generated at step 1119. The number of filter coefficients that may be stored can be reduced by allocating the same coefficient to multiple taps. This process is referred to as filter expansion. At step 1125, filtering with respect to the deteriorated input signal is executed to generate an undeteriorated signal. Filter coefficients are selected adaptively according to the multiple class ID which is generated in step 1119.

[0080] For further information regarding classified adaptive error recovery, see U.S. patent application Ser. No. ______, titled “Classified Adaptive Error Recovery Method and Apparatus”, filed concurrently herewith, and is herewith incorporated by reference.

[0081] Although the present invention is discussed with respect to image data, the present invention may be used with any form of correlated data, including without limitation photographs or other two-dimensional static images, holograms, or other three-dimensional static images, video or other two-dimensional moving images, three-dimensional moving images, a monaural sound stream, or sound separated into a number of spatially related streams, such as stereo.

[0082]FIG. 12 shows an example of an audio signal and how it is compatible with the present invention.

[0083] An example of audio signal 1201 is monitored at one or more time points t0-t8. The level of audio signal 1201 at time points t0-t8 is given by tap points X0-X8. The dynamic range of the audio signal 1201 is given as the difference between the lowest level tap point X0 and the highest level tap point X4. In addition to dynamic range, the standard deviation, the Laplacian value or the spatial gradient value can be introduced for spatial activity classification.

[0084] The invention has been described in conjunction with the preferred embodiment. It is evident that numerous alternatives, modifications, variations and uses will be apparent to those skilled in the art in light of the foregoing description. 

What is claimed is:
 1. A method for recovery of lost/damaged data comprising the steps of: generating candidate hypotheses of decoding for lost/damaged data within a received bitstream of data; generating scores for the candidate hypotheses; selecting a hypothesis corresponding to a best score from the generated scores; decoding the lost/damaged data according to the selected hypothesis; evaluating at least one candidate hypothesis and selectively flagging data based upon the evaluation; and executing an error recovery process on the flagged data.
 2. The method as set forth in claim 1, wherein the step of evaluating comprises examining at least one score distribution of at least one candidate hypothesis.
 3. The method as set forth in claim 2, wherein the step of evaluating comprises comparing th e score distribution to a threshold.
 4. The method as set forth in claim 2, wherein data of the received bitstream of data is divided into a plurality of block units of varying length, the candidate hypotheses indicate the endpoint of at least one block unit, and the step of evaluating is performed across at least a portion of the plurality of block units.
 5. The method as set forth in claim 4, wherein data is flagged for the plurality of blocks.
 6. The method as set forth in claim 4, wherein a block unit is selected from the group consisting of a block or group of blocks.
 7. The method as set forth in claim 4, wherein the block unit is of varying lengths.
 8. The method as set forth in claim 1, wherein: the received data is divided into a plurality of block units; the selected candidate hypothesis indicating the endpoint of at least one block unit; and the step of evaluating comprising evaluating combined candidate hypotheses for at least a portion of the plurality of block units.
 9. The method as set forth in claim 8, wherein the step of evaluating comprises generating a combined score distribution.
 10. The method as set forth in claim 9, wherein the step of evaluating comprises comparing the combined score distribution to a combined threshold.
 11. The method as set forth in claim 2, wherein the score distribution is determined according to a difference function between values derived from the scores of the candidate hypotheses.
 12. The method as set forth in claim 2, wherein the score distribution is determined according to the difference between a best score of scores of the candidate hypotheses and a second best score of the scores of candidate hypotheses.
 13. The method as set forth in claim 1, wherein the bitstream comprises data selected from the group consisting of correlated data, image data and audio data.
 14. The method as set forth in claim 1, wherein the bitstream comprises image data and the error recovery process comprises a pixel error recovery method.
 15. The method as set forth in claim 10, wherein the bitstream comprises image data divided into a plurality of blocks and the error recovery process comprises a pixel error recovery process that uses neighboring block information to recover pixel data of flagged data.
 16. An apparatus for recovery of lost/damaged data comprising: a data recovery circuit configured to generate candidate hypotheses for lost/damaged data within a received bitstream of data, generate scores for the candidate hypotheses, select a hypotheses corresponding to a best score from the generated scores and decode the lost/damaged data according to the selected hypothesis; an error propagation detection circuit coupled to the data recovery circuit, the error propagation circuit configured to selectively flag data based upon an evaluation of the candidate hypotheses; and an error recovery circuit coupled to the data recovery circuit and the error propagation detection circuit, the error recovery circuit configured to execute error recovery on the flagged data.
 17. The apparatus as set forth in claim 16, wherein the error propagation circuit performs an evaluation by examining at least one score distribution corresponding to the candidate hypotheses.
 18. The apparatus as set forth in claim 17, wherein the error propagation circuit performs an evaluation by comparing the score distribution to a threshold.
 19. The apparatus as set forth in claim 16, wherein the bitstream comprises image data and the error recovery method comprises a pixel error recovery method.
 20. The apparatus as set forth in claim 16, wherein the bitstream comprises image data divided into blocks and the error recovery method comprises a pixel error recovery method that uses neighboring block information to recover pixel data of flagged data.
 21. The apparatus as set forth in claim 17, wherein received data is divided into a plurality of block units, the candidate hypotheses indicating the endpoint of at least one block unit, the score distribution assembled across at least a portion of the plurality of block units.
 22. The apparatus as set forth in claim 21, wherein the error propagation detection circuit flags the data in the plurality of blocks for which an error recovery method is required.
 23. The apparatus as set forth in claim 21, wherein a block unit is selected from the group consisting of a block or group of blocks.
 24. The apparatus as set forth in claim 21, wherein the received data is divided into a plurality of block units, the selected candidate hypothesis indicating the endpoint of at least one block unit and the evaluation comprising an evaluation of combined candidate hypotheses for at least a portion of the plurality of block units.
 25. The apparatus as set forth in claim 24, wherein the evaluation comprises a combined score distribution using score distributions corresponding to at least a portion of the plurality of block units.
 26. The apparatus as set forth in claim 25, wherein the evaluation further comprises a comparison of the combined score distribution to a combined threshold.
 27. The apparatus as set forth in claim 17, wherein the score distribution is determined according to the difference between a best score of scores of the candidate hypotheses and a second best score of the scores of candidate hypotheses.
 28. The apparatus as set forth in claim 16, wherein the bitstream comprises data selected from the group consisting of correlated data, image data and audio data.
 29. The apparatus as set forth in claim 16, wherein the data recovery circuit and error propagation detection circuit comprises circuitry selected from the group consisting of logic circuits and a processor.
 30. A computer readable medium comprising instructions, which when executed in a processing system, cause the system to perform the steps for data recovery of lost/damaged data, comprising: generating candidate hypotheses of decoding for lost/damaged data within a received bitstream of data; generating scores for the candidate hypotheses; selecting a hypothesis corresponding to a best score from the generated scores; decoding the lost/damaged data according to the selected hypothesis; evaluating the candidate hypotheses and selectively flagging data based upon the evaluation; and executing an error recovery process on the flagged data.
 31. The computer readable medium as set forth in claim 30, wherein evaluating comprises examining at least one score distribution of at least one candidate hypothesis.
 32. The computer readable medium as set forth in claim 31, wherein evaluating comprises comparing the score distribution to a threshold.
 33. The computer readable medium as set forth in claim 30, wherein the data of the received bitstream of data is divided into a plurality of block units of varying length, the candidate hypotheses indicate the endpoint of at least one block unit, and the step of evaluating is performed across at least a portion of the plurality of block units.
 34. The computer readable medium as set forth in claim 33, wherein data is flagged for the plurality of blocks.
 35. The computer readable medium as set forth in claim 33, wherein a block unit is selected from the group consisting of a block or group of blocks.
 36. The computer readable medium as set forth in claim 30, wherein: the received data is divided into a plurality of block units; the selected candidate hypothesis indicating the endpoint of at least one block unit; and the step of evaluating comprising evaluating combined candidate hypotheses for at least a portion of the plurality of block units.
 37. The computer readable medium as set forth in claim 36, wherein the step of evaluating comprises generating a combined score distribution.
 38. The computer readable medium as set forth in claim 37, wherein the step of evaluating comprises comparing the combined score distribution to a combined threshold.
 39. The computer readable medium as set forth in claim 30, wherein the bitstream comprises data selected from the group consisting of correlated data, image data and audio data.
 40. An apparatus for recovery of lost/damaged data comprising the steps of: means for generating candidate hypotheses of decoding for lost/damaged data within a received bitstream of data; means for generating scores for the candidate hypotheses; means for selecting a hypothesis corresponding to a best score from the generated scores; means for decoding the lost/damaged data according to the selected hypothesis; means for evaluating the candidate hypotheses and selectively flagging data based upon the evaluation; and means for executing an error recovery process on the flagged data.
 41. A method for recovery of data comprising the steps of: generating candidate hypotheses for lost/damaged data within a received bitstream of data; assembling at least one score distribution using candidate hypotheses; and selectively flagging data that an error recovery method is required for based upon the score distribution.
 42. The method as set forth in claim 41, wherein data of the received bitstream of data is divided into a plurality of block units of varying length, the candidate hypotheses indicate the endpoint of at least one block unit, and the score distribution is assembled across at least a portion of the plurality of block units.
 43. The method as set forth in claim 42, wherein the step of flagging selectively flags the data in the plurality of blocks for which an error recovery method is required.
 44. The method as set forth in claim 2, wherein a block unit is selected from the group consisting of a block or group of blocks.
 45. The method as set forth in claim 1, wherein the received data is divided into a plurality of block units, the candidate hypotheses indicate the endpoint of at least one block unit, the step of assembling comprising the step of if a score distribution for a block unit of the plurality of block units is within a range defined by an individual threshold, generating a combined score distribution of the score distributions for at least a portion of the plurality of block units; and the step of flagging comprising the step of if the combined score distribution is within a range defined by a combined threshold, flagging that an error recovery method is required for the at least a portion of the plurality of block units.
 46. The method as set forth in claim 41, wherein the score distribution is determined according to a difference function between values derived from the scores of the candidate hypotheses.
 47. The method as set forth in claim 41, wherein the score distribution is determined according to the difference between a best score of scores of the candidate hypotheses and a second best score of the scores of candidate hypotheses.
 48. The method as set forth in claim 41, wherein the bitstream comprises data selected from the group consisting of correlated data, image data and audio data.
 49. The method as set forth in claim 41, further comprising the step of performing an error recovery method for flagged data.
 50. The method as set forth in claim 49, wherein the bitstream comprises image data and the error recovery method comprises a pixel error recovery method.
 51. The method as set forth in claim 49, wherein the bitstream comprises image data divided into a plurality of blocks and the error recovery method comprises a pixel recovery method that uses neighboring block information to recover pixel data of flagged data.
 52. An apparatus for recovery of data comprising the steps of: a data recovery circuit configured to generate candidate hypotheses for lost/damaged data within a received bitstream of data and assemble at least one score distribution using candidate hypotheses; and an error propagation detection circuit coupled to the data recovery circuit, the error propagation detection circuit configured to selectively flag data that an error recovery method is required for based upon the score distribution.
 53. The apparatus as set forth in claim 52, further comprising an error recovery circuit coupled to the error propagation detection circuit, the error recovery circuit configured to generate an error recovery method for flagged data.
 54. The apparatus as set forth in claim 53, wherein the bitstream comprises image data and the error recovery method comprises a pixel error recovery method.
 55. The apparatus as set forth in claim 53, wherein the bitstream comprises image data divided into blocks and the error recovery method comprises a pixel error recovery method that uses neighboring block information to recover pixel data of flagged data.
 56. The apparatus as set forth in claim 53, wherein received data is divided into a plurality of block units of varying length, the candidate hypotheses indicating the endpoint of at least one block unit, the score distribution assembled across the plurality of block units.
 57. The apparatus as set forth in claim 56, wherein the error propagation detection circuit flags the data in the plurality of blocks for which an error recovery method is required.
 58. The apparatus as set forth in claim 52, wherein received data is divided into a plurality of block units, the candidate hypotheses indicating the endpoint of at least one block unit, the error propagation detection circuit further configured to: generate a combined score distribution of the score distributions for at least a portion of the plurality of block units if a score distribution for a block unit of the plurality of block units is within a range defined by an individual threshold; and selectively flag that an error recovery method is required for the at least a portion of the plurality of block units if the combined score distribution is within a range defined by a combined threshold.
 59. The apparatus as set forth in claim 52, wherein the score distribution is determined according to a difference function between values derived from the scores of the candidate hypotheses.
 60. The apparatus as set forth in claim 52, wherein the score distribution is determined according to the difference between a best score of scores of the candidate hypotheses and a second best score of the scores of candidate hypotheses.
 61. The apparatus as set forth in claim 52, wherein the bitstream comprises data selected from the group consisting of correlated data, image data and audio data.
 62. The apparatus as set forth in claim 52, wherein the data recovery circuit and error propagation detection circuit comprises circuitry selected from the group consisting of logic circuits and a processor.
 63. A computer readable medium comprising instructions, which when executed in a processing system, causes the system to perform the steps for recovery of data, comprising: generating candidate hypotheses for lost/damaged data within received data; assembling at least one score distribution using at least one candidate hypothesis; and selectively flagging data that an error recovery method is required for based upon the score distribution.
 64. The computer readable medium as set forth in claim 63, wherein received data is divided into a plurality of block units of varying length, the candidate hypotheses indicating the endpoint of at least one block unit, the score distribution assembled across the plurality of block units.
 65. The computer readable medium as set forth in claim 64, wherein the instruction that, when executed, flags an error recovery method for the data flags an error recovery method for the plurality of blocks.
 66. The computer readable medium as set forth in claim 63, wherein received data is divided into a plurality of block units of varying lengths, the candidate hypotheses indicating the endpoint of at least one block unit, the instruction which, when executed, assembles a score distribution comprises if a score distribution for a block unit of the plurality of block units is within a range defined by an individual threshold, generating a combined score distribution of the score distributions for at least a portion of the plurality of block units; and the instruction, which when executed flags data comprises if the combined score distribution is within a range defined by a combined threshold, flagging that an error recovery method is required for the at least a portion of the plurality of block units.
 67. The computer readable medium as set forth in claim 63, wherein the score distribution is determined according to a difference function between values derived from the scores of the candidate hypotheses.
 68. The computer readable medium as set forth in claim 63, wherein the bitstream comprises data selected from the group consisting of correlated data, image data and audio data.
 69. The computer readable medium as set forth in claim 63, further comprising instructions which, when executed, comprise performing an error recovery method for flagged data.
 70. The computer readable medium as set forth in claim 69, wherein the bitstream comprises image data and the error recovery method comprises a pixel error recovery method.
 71. An apparatus for recovery of data comprising: means for generating candidate hypotheses data recovery methods to lost/damaged data; means for assembling at least one score distribution using at least one candidate hypothesis; means for selectively flagging that an error recovery method is required based upon the score distribution.
 72. A method for recovery of data from a bitstream of data comprising the steps of: detecting errors in data due to error propagation within the bitstream of data; and performing a data error recovery process on data with detected errors.
 73. The method as set forth in claim 72, wherein the bitstream comprises data selected from the group consisting of correlated data, image data and audio data.
 74. The method as set forth in claim 72, wherein the step of detecting comprises the steps of: generating candidate hypotheses for lost/damaged data within a received bitstream of data; assembling a score distribution using candidate hypotheses; and if the score distribution is within a range defined by a threshold, detecting an error.
 75. The method as set forth in claim 72, wherein the bitstream of data comprises image data and the step of performing a data error recovery process on data comprises using a pixel error recovery process.
 76. The method as set forth in claim 75, wherein the pixel error recovery process comprises a classified adaptive pixel error recovery process.
 78. The method as set forth in claim 72, further comprising the step of receiving error flags indicative of errors with respect to data of the bitstream, said step of performing a data error recovery process further comprising performing the data error recovery process on the data corresponding to received error flags.
 79. The method as set forth in claim 72, wherein the step of performing a data error recovery process is performed on at least one block unit of data.
 80. The method as set forth in claim 72, further comprising the steps of: decoding at least a portion of the bitstream of data; preventing data degradation by performing a block unit recovery process on the decoded data in block units in which errors due to error propagation are detected, said step of preventing performed prior to the step of performing a data error recovery process.
 81. An apparatus for recovery of data from a bitstream of data comprising the steps of: a data recovery circuit configured to generate candidate hypotheses for lost/damaged data within a received bitstream of data; an error propagation detection circuit coupled to the data recovery circuit, said error propagation detection circuit configured to detect errors in data due to error propagation within the bitstream of data; and an error recovery circuit coupled to the error propagation detection circuit, the error recovery circuit configured to perform a data error recovery process on data with detected errors.
 82. The apparatus as set forth in claim 81, wherein the bitstream comprises data selected from the group consisting of correlated data, image data and audio data.
 83. The apparatus as set forth in claim 81, wherein the error propagation detection circuit generates candidate hypotheses for lost/damaged data within a received bitstream of data, assembles a score distribution using candidate hypotheses, and detects an error if the score distribution is within a range defined by a threshold.
 84. The apparatus as set forth in claim 81, wherein the bitstream of data comprises image data and the error recovery circuit uses a pixel error recovery process.
 85. The apparatus as set forth in claim 84, wherein the error recovery circuit uses a classified adaptive pixel error recovery process.
 86. The apparatus as set forth in claim 81, further comprising a pixel error flag circuit configured to receive error flags indicative of errors with respect to data of the bitstream, said error recovery circuit further configured to performing error recovery on the data corresponding to received error flags.
 87. The apparatus as set forth in claim 81, wherein the error recovery circuit performs error recovery on at least one block of data.
 88. The apparatus as set forth in claim 81, further comprising: a decoder coupled to receive and decode at least a portion of the bitstream of data; a data degradation prevention unit coupled to the decoder and the error propagation detection circuit and configured to perform a block unit recovery process on the decoded data in block units in which errors due to error propagation are detected.
 89. A computer readable medium comprising instructions, which when executed in a processing system, causes the system to perform the steps for recovery of data, comprising: detecting errors in data due to error propagation within the bitstream of data; and performing a data error recovery process on data with detected errors.
 90. The computer readable medium as set forth in claim 89, wherein the bitstream comprises data selected from the group consisting of correlated data, image data and audio data.
 91. The computer readable medium as set forth in claim 89, wherein detecting comprises: generating candidate hypotheses for lost/damaged data within a received bitstream of data; assembling a score distribution using candidate hypotheses; and if the score distribution is within a range defined by a threshold, detecting an error.
 92. The computer readable medium as set forth in claim 89, wherein the bitstream of data comprises image data and performing a data error recovery process on data comprises using a pixel error recovery process.
 93. The computer readable medium as set forth in claim 89, further comprising instructions, which when executed performing a process comprising receiving error flags indicative of errors with respect to data of the bitstream, the instructions which when executed perform a data error recovery process further comprising performing the data error recovery process on the data corresponding to received error flags.
 94. The computer readable medium as set forth in claim 89, wherein a data error recovery process is applied to at least one block unit of data.
 95. The computer readable medium as set forth in claim 94, further comprising instructions, which when executed, perform a process comprising: decoding at least a portion of the bitstream of data; preventing data degradation by performing a block unit recovery process on the decoded data in block units in which errors due to error propagation are detected, preventing performed prior to performing a data error recovery process.
 96. An apparatus for recovery of data from a bitstream of data comprising the steps of: means for detecting errors in data due to error propagation within the bitstream of data; and means for performing a data error recovery process on data with detected errors. 